Motion Planning in A Society of Mobile Agents

نویسندگان

  • James Campbell
  • Albert Esterline
چکیده

Groups or societies of agents may collaborate on a common goal and thereby achieve more than by working individually. This paper discusses the use of societal theories to model the carrying out of a plan by a group of agents. We focus on plans that relate to agent motion since the low-level aspects of such plans are well understood and motion provides clear criteria for successful planning. We use statecharts to represent these plans, which are hierarchically structured and require concurrent behavior. We represent norms as statements in deontic logic, and we annotate statechart plans with such statements to indicate that certain norms apply to certain groups. In fact, the transitions in a statechart are often naturally interpreted in a normative way. Using deontic logic allows us to distinguish ideal behavior from actual behavior that violates norms and hence to represent fault tolerance. The follow section introduces societal norms and relates them to motion planning. Section 3 presents statecharts and introduces deontic statecharts. Section 4 is an extended example, and Section 5 discusses planning, specifically, how a successful multi-agent motion plan of the form we discuss may be constructed. Section 6 is the conclusion.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Direct Optimal Motion Planning for Omni-directional Mobile Robots under Limitation on Velocity and Acceleration

This paper describes a low computational direct approach for optimal motion planning and obstacle avoidance of Omni-directional mobile robots within velocity and acceleration constraints on the robot motion. The main purpose of this problem is the minimization of a quadratic cost function while limitation on velocity and acceleration of robot is considered and collision with any obstacle in the...

متن کامل

Mobile Robot Online Motion Planning Using Generalized Voronoi Graphs

In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...

متن کامل

Optimal Trajectory Planning of a Box Transporter Mobile Robot

This paper aims to discuss the requirements of safe and smooth trajectory planning of transporter mobile robots to perform non-prehensile object manipulation task. In non-prehensile approach, the robot and the object must keep their grasp-less contact during manipulation task. To this end, dynamic grasp concept is employed for a box manipulation task and corresponding conditions are obtained an...

متن کامل

Optimal Trajectory Planning of a Mobile Robot with Spatial Manipulator For Spatial Obstacle Avoidance

Mobile robots that consist of a mobile platform with one or many manipulators mounted on it are of great interest in a number of applications. Combination of platform and manipulator causes robot operates in extended work space. The analysis of these systems includes kinematics redundancy that makes more complicated problem. However, it gives more feasibility to robotic systems because of the e...

متن کامل

Geometric Motion Planning: Finding Intersections

We investigate a new model for mobile agents: Motion planning with geometric primitives, similar to rulerand-circle constructions in classical geometry. In this first paper on this subject, we consider finding intersection points between two geometric objects using mobile agents that move on these objects. This amounts to finding the rendezvous point of the two agents.

متن کامل

Designing Solvable Graphs for Multiple Moving Agents

Solvable Graphs (also known as Reachable Graphs) are types of graphs that any arrangement of a specified number of agents located on the graph’s vertices can be reached from any initial arrangement through agents’ moves along the graph’s edges, while avoiding deadlocks (interceptions). In this paper, the properties of Solvable Graphs are investigated, and a new concept in multi agent moti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998